Digital Logic
Q41.
What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don't care term.Q42.
The dual of a Boolean function F(x_{1},x_{2},...,x_{n}, +, \cdot , ' ) , written as F^{D}, is the same expression as that of F with + and \cdot swapped. F is said to be self-dual if F=F^{D}. The number of self-dual functions with n Boolean variables isQ44.
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete ?Q45.
Let \oplus denote the Exclusive OR (XOR) operation. Let '1' and '0' denote the binary constants. Consider the following Boolean Algebra for F over two variables P and Q. F(P,Q)=((1\oplus P)\oplus (P\oplus Q)) \oplus ((P\oplus Q) \oplus (Q\oplus 0)) The equivalent expression for F isQ48.
The output of a 2-input multiplexer is connected back to one of its inputs as shown in the figure.Match the functional equivalence of this circuit to one of the following options.Q49.
Consider the 4-to-1 multiplexer with two lines S1 and S0 given below. The minimal sum of-products form of the Boolean expression for the output F of the multiplexer isQ50.
How many 2-input multiplexers are required to construct a 2^{10}-input multiplexer?